First-order satisfiability in Gödel logics: An NP-complete fragment
نویسندگان
چکیده
Defined over sets of truth values V which are closed subsets of [0, 1] containing both 0 and 1, Gödel logics GV are prominent examples of many-valued logics. We investigate a first-order fragment of GV extended with ∆ that is powerful enough to formalize important properties of fuzzy rule-based systems. The satisfiability problem in this fragment is shown to be NP-complete for all GV , also in presence of an additional, involutive, negation. In contrast to the one-variable case, in the considered fragment only two infinite-valued Gödel logics extended with ∆ differ w.r.t. satisfiability. Only one of them enjoys the finite model property.
منابع مشابه
Lewis Dichotomies in Many-Valued Logics
In 1979, H. Lewis shows that the computational complexity of the Boolean satisfiability problem dichotomizes, depending on the Boolean operations available to formulate instances: intractable (NP-complete) if negation of implication is definable, and tractable (in P) otherwise [17]. Recently, an investigation in the same spirit has been extended to nonclassical propositional logics, modal logic...
متن کاملDecidability of order-based modal logics
Decidability of the validity problem is established for a family of many-valued modal logics, notably modal logics based on Gödel logics, where propositional connectives are evaluated locally at worlds according to the order of values in a complete sublattice of the real unit interval, and box and diamond modalities are evaluated as infima and suprema of values in (many-valued) Kripke frames. W...
متن کاملHybrid Logics on Linear Structures: Expressivity and Complexity
We investigate expressivity and complexity of hybrid logics on linear structures. Hybrid logics are an enrichment of modal logics with certain first-order features which are algorithmically well behaved. Therefore, they are well suited for the specification of certain properties of computational systems. We show that hybrid logics are more expressive than usual modal and temporal logics on line...
متن کاملSAT in Monadic Gödel Logics: A Borderline between Decidability and Undecidability
We investigate satisfiability in the monadic fragment of firstorder Gödel logics. These are a family of finiteand infinite-valued logics where the sets of truth values V are closed subsets of [0, 1] containing 0 and 1. We identify conditions on the topological type of V that determine the decidability or undecidability of their satisfiability problem.
متن کاملThe Complexity of Monotone Hybrid Logics over Linear Frames and the Natural Numbers
Hybrid logic with binders is an expressive specification language. Its satisfiability problem is undecidable in general. If frames are restricted to N or general linear orders, then satisfiability is known to be decidable, but of non-elementary complexity. In this paper, we consider monotone hybrid logics (i.e., the Boolean connectives are conjunction and disjunction only) over N and general li...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Theor. Comput. Sci.
دوره 412 شماره
صفحات -
تاریخ انتشار 2011